Secret sharing in compartmented groups using ideal codes
نویسندگان
چکیده
We propose a secret sharing scheme based on rings or modules that admit a decomposition given by orthogonal idempotents of the ring. The secret is decomposed into partial secrets that belong to the projections induced by every idempotent. These projections are indeed ideal codes and thus the subsecrets are distributed among a group of users using the generator matrix of these ideal codes.
منابع مشابه
Secret sharing schemes for Multipartite access structures
Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. Secret sharing schemes are introduced to solve the problems for securing sensitive information. In this paper, we review our proposed hierarchical and compartmented ...
متن کاملJoint Compartmented Threshold Access Structures
A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions is called the access structure. An access structure is called monotone if every coalition containing a qualif...
متن کاملA Probabilistic Secret Sharing Scheme for a Compartmented Access Structure
In a compartmented access structure, there are disjoint participants C1, . . . , Cm. The access structure consists of subsets of participants containing at least ti from Ci for i = 1, . . . , m, and a total of at least t0 participants. Tassa [2] asked: whether there exists an efficient ideal secret sharing scheme for such an access structure? Tassa and Dyn [5] presented a solution using the ide...
متن کاملCompartmented Secret Sharing Based on the Chinese Remainder Theorem
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups. In case of compartmented secret sharing, the set of users is partitioned into compartments and the secret can be recovered only if the number of participants from any compartment is greater than a fixe...
متن کاملIdeal Hierarchical (t, n) Secret Sharing Schemes
A secret sharing scheme divides a secret into multiple shares by a dealer and shared among shareholders in such a way that any authorized subset of shareholders can reconstruct the secret; whereas any un-authorized subset of shareholders cannot recover the secret. If the maximal length of shares is equal to the length of the secret in a secret sharing scheme, the scheme is called ideal. If the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014